翻訳と辞書 Words near each other ・ Grammodes geometrica ・ Grammodes justa ・ Grammodes microgonia ・ Grammodes ocellata ・ Grammodes oculicola ・ Grammodes pulcherrima ・ Grammodes quaesita ・ Grammodes stolida ・ Grammar public school rawalpindi ・ Grammar school ・ Grammar School at Leeds ・ Grammar School of Diósgyőr ・ Grammar School Rawalpindi ・ Grammar Schools Act 1860 ・ Grammar schools debate ・ Grammar systems theory ・ Grammar TEC RC ・ Grammar-based code ・ Grammar-oriented programming ・ Grammar-translation method ・ Grammarctia ・ Grammarian ・ Grammarian (Greco-Roman world) ・ Grammarians' War ・ Grammarly ・ Grammarsgate ・ Grammata Serica Recensa ・ GrammaTech ・ Grammatica ・ Grammatica de Interlingua Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Grammar systems theory ： ウィキペディア英語版 Grammar systems theory Grammar systems theory is a field of theoretical computer science that studies systems of finite collections of formal grammars generating a formal language. Each grammar works on a string, a so-called ''sequential form'' that represents an environment. Grammar systems can thus be used as a formalization of decentralized or distributed systems of agents in artificial intelligence.〔 〕 Let $\backslash mathbb$ be a simple reactive agent moving on the table and trying not to fall down from the table with two reactions, ''t'' for turning and ''ƒ'' for moving forward. The set of possible behaviors of $\backslash mathbb$ can then be described as formal language : $\backslash mathbb=\backslash ,$ where ''ƒ'' can be done maximally ''k'' times and ''t'' can be done maximally ''ℓ'' times considering the dimensions of the table.〔 〕 Let $\backslash mathbb$ be a formal grammar which generates language $\backslash mathbb$. The behavior of $\backslash mathbb$ is then described by this grammar. Suppose the $\backslash mathbb$ has a subsumption architecture; each component of this architecture can be then represented as a formal grammar too and the final behavior of the agent is then described by this ''system of grammars''. The schema on the right describes such a system of grammars which shares a common string representing an environment. The shared sequential form is sequentially rewritten by each grammar, which can represent either a component or generally an agent. If grammars communicate together and work on a shared sequential form, it is called a ''Cooperating Distributed (DC)'' grammar system. Shared sequential form is a similar concept to the blackboard approach in AI,〔 which is inspired by an idea of experts solving some problem together while they share their proposals and ideas on a shared blackboard. Each grammar in a grammar system can also work on its own string and communicate with other grammars in a system by sending their sequential forms on request. Such a grammar system is then called a ''Parallel Communicating (PC)'' grammar system.〔 PC and DC are inspired by distributed AI. If there is no communication between grammars, the system is close to the decentralized approaches in AI. These kinds of grammar systems are sometimes called ''colonies'' or ''Eco-Grammar'' systems, depending (besides others) on whether the environment is changing on its own (Eco-Grammar system) or not (colonies).〔 ==See also== * Artificial life * Agent-based model * Distributed artificial intelligence * Multi-agent system 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Grammar systems theory」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.